A simple algorithm for finding short sigma-definite representatives
نویسندگان
چکیده
منابع مشابه
Every Braid Admits a Short Sigma-definite Representative
A result by Dehornoy (1992) says that every nontrivial braid admits a σ-definite word representative, defined as a braid word in which the generator σi with maximal index i appears with exponents that are all positive, or all negative. This is the ground result for ordering braids. In this paper, we enhance this result and prove that every braid admits a σ-definite word representative that, in ...
متن کاملAN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
متن کاملA Simple SVD Algorithm for Finding Hidden Partitions
Finding a hidden partition in a random environment is a general and important problem, which contains as subproblems many important questions, such as finding a hidden clique, finding a hidden coloring, finding a hidden bipartition etc. In this paper, we provide a simple SVD algorithm for this purpose, answering a question of McSherry. This algorithm is easy to implement and works for sparse gr...
متن کاملA Simple Algorithm for Finding All k-Edge-Connected Components
The problem of finding k-edge-connected components is a fundamental problem in computer science. Given a graph G = (V, E), the problem is to partition the vertex set V into {V1, V2,…, Vh}, where each Vi is maximized, such that for any two vertices x and y in Vi, there are k edge-disjoint paths connecting them. In this paper, we present an algorithm to solve this problem for all k. The algorithm...
متن کاملA SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS
Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2012
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2011.09.039